Performance Analysis of Queueing Networks with Complete Buffer Partitioning

This chapter extends the analysis of networks of queues under repetitive service blocking mechanism presented in Chapter 4 by considering a different buffer management scheme, namely, complete buffer partitioning (CBP). This analysis considers the networks with arbitrary configuration where each node in the networks employs an active queue management (AQM) type buffer management scheme to guarantee certain quality of service for multiple class external traffic. The analysis is based on a queue-by-queue decomposition technique where each queue is modeled as a G E / G E / l / N queue with single server, R (R > 2) distinct traffic classes and { N = N l , N 2 , ... , N R } buffer partitions for each class under first-come-first-serve (FCFS) service rule. The external traffic is modeled using the Generalised Exponential (GE) distribution which can capture the bursty property of network traffic. The analytical solution is obtained using the Maximum Entropy (ME) principle. The forms of the state and blocking probabilities are analytically established at equilibrium via appropriate mean value constraints. The initial numerical results demonstrate the credibility of the proposed analytical solution. My main reseach contribution is included in chapter (4,5).